Coprime array‐adaptive beamforming via atomic‐norm‐based sparse recovery
نویسندگان
چکیده
منابع مشابه
Sparse Recovery via Differential Inclusions
In this paper, we recover sparse signals from their noisy linear measurements by solving nonlinear differential inclusions, which we call Bregman ISS and Linearized Bregman ISS. We show that under proper conditions, there exists a bias-free and sign-consistent point on their solution paths, which corresponds to a signal that is the unbiased estimate of the true signal and whose entries have the...
متن کاملOn the Performance of Sparse Recovery via
It is known that a high-dimensional sparse vector x∗ in Rn can be recovered from low-dimensional measurements y = Ax∗ where Am×n(m < n) is the measurement matrix. In this paper, with A being a random Gaussian matrix, we investigate the recovering ability of `p-minimization (0 ≤ p ≤ 1) as p varies, where `p-minimization returns a vector with the least `p quasi-norm among all the vectors x satisf...
متن کاملSparse Recovery with Fusion Frames via RIP
We extend ideas from compressive sensing to a structured sparsity model related to fusion frames. We present theoretical results concerning the recovery of sparse signals in a fusion frame from undersampled measurements. We provide both nonuniform and uniform recovery guarantees. The novelty of our work is to exploit an incoherence property of the fusion frame which allows us to reduce the numb...
متن کاملJointly Sparse Vector Recovery via Reweighted
An iterative reweighted algorithm is proposed for the recovery of jointly sparse vectors from multiple-measurement vectors (MMV). The proposed MMV algorithm is an extension of the iterative reweighted 1 algorithm for single measurement problems. The proposed algorithm (M-IRL1) is demonstrated to outperform non-reweighted MMV algorithms under noiseless measurements. A regularization of the M-IRL...
متن کاملSparse Signal Recovery via Correlated Degradation Model
Sparse signal recovery aims to recover an unknown signal x ∈ R from few non-adaptive, possibly noisy, linear measurements y∈R using a nonlinear sparsity-promoting algorithm, under the assumption that x is sparse or compressible with respect to a known basis or frame [1]. Specifically, y = Ax+ e, where A ∈ Rm×n is the measurement matrix, e ∈ R is the measurement error, and m n. Many of the spars...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Radar, Sonar & Navigation
سال: 2021
ISSN: 1751-8784,1751-8792
DOI: 10.1049/rsn2.12141